Probabilistic Argumentation: An Equational Approach
نویسندگان
چکیده
منابع مشابه
Probabilistic Argumentation. An Equational Approach
There is a generic way to add any new feature to a system. It involves 1) identifying the basic units which build up the system and 2) introducing the new feature to each of these basic units. In the case where the system is argumentation and the feature is probabilistic we have the following. The basic units are: a. the nature of the arguments involved; b. the membership relation in the set S ...
متن کاملIntroducing EqArgSolver: An argumentation solver using equational semantics
In this paper we introduce EqArgSolver, an argumentation solver using equational semantics. EqArgSolver is based on the prototype GRIS submitted to the first International Competition on Computational Models of Argumentation, but provides two major advancements over GRIS. Firstly, it uses the much more e cient discrete version of the Gabbay-Rodrigues Iteration Schema [7], and secondly, it requi...
متن کاملIntroducing Equational Semantics for Argumentation Networks
This paper provides equational semantics for Dung’s argumentation networks. The network nodes get numerical values in [0,1], and are supposed to satisfy certain equations. The solutions to these equations correspond to the “extensions” of the network. This approach is very general and includes the Caminada labelling as a special case, as well as many other so-called network extensions, support ...
متن کاملProbabilistic data flow analysis: a linear equational approach
Speculative optimisation relies on the estimation of the probabilities that certain properties of the control flow are fulfilled. Concrete or estimated branch probabilities can be used for searching and constructing advantageous speculative and bookkeeping transformations. We present a probabilistic extension of the classical equational approach to data-flow analysis that can be used to this pu...
متن کاملEquational Axioms for Probabilistic Bisimilarity
This paper gives an equational axiomatization of probabilistic bisimulation equivalence for a class of finite-state agents previously studied by Stark and Smolka ((2000) Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 571–595). The axiomatization is obtained by extending the general axioms of iteration theories (or iteration algebras), which characterize the equational p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logica Universalis
سال: 2015
ISSN: 1661-8297,1661-8300
DOI: 10.1007/s11787-015-0120-1